Symmetric Polynomials and Some Good Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes

We present a symmetric LDPC code with constant rate and constant distance (i.e. good LDPC code) that its constraint space is generated by the orbit of one constant weight constraint under a group action. Our construction provides the first symmetric LDPC good codes. This solves the main open problem raised by Kaufman and Wigderson in [4].

متن کامل

On Some Universally Good Fractional Repetition Codes

Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O etc. in such systems. Regenerating codes have been used to optimize some of these parameters, where a file can be reconstructed by contacting any k...

متن کامل

Some good quantum error-correcting codes from algebraic-Geometric codes

It is shown that the quantum error-correction can be acheived by the using of classical binary codes or additive codes over F4 (see [1],[2],[3]). In this paper with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results ar...

متن کامل

Remarks on two symmetric polynomials and some matrices

By means of comp lete symmetric polynomials this paper gives a new proof for the Vander-monde determinant formula. Another alternative proof for this formula is obtained via the collocatio n matrices. It also gives a generalized relationship between the Vandermo nde, the Pascal and the Stirling matrices. A new app roach to obtain the explicit inverse of the Vandermo nde matrix is investigated. ...

متن کامل

Some Good Cyclic and Quasi-Twisted Z4-Linear Codes

For over a decade, there has been considerable research on codes over Z4 and other rings. In spite of this, no tables or databases exist for codes over Z4, as is the case with codes over finite fields. The purpose of this work is to contribute to the creation of such a database. We consider cyclic, negacyclic and quasi-twisted (QT) codes over Z4. Some of these codes have binary images with bett...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2001

ISSN: 1071-5797

DOI: 10.1006/ffta.2000.0305